An LVQ-based adaptive algorithm for learning from very small codebooks

نویسندگان

  • José Salvador Sánchez
  • A. I. Marqués
چکیده

The present paper introduces an adaptive algorithm for competitive training of a nearest neighbor (NN) classifier when using a very small codebook. The new learning rule is based on the well-known LVQ method, and uses an alternative neighborhood concept to estimate optimal locations of the codebook vectors. Experiments over synthetic and real databases suggest the advantages of the learning technique here introduced. r 2005 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Vector Quantization With Alternative Distance Criteria

An adaptive algorithm for training of a Nearest Neighbour (NN) classifier is developed in this paper. This learning rule has got some similarity to the well-known LVQ method, but using the nearest centroid neighbourhood concept to estimate optimal locations of the codebook vectors. The aim of this approach is to improve the performance of the standard LVQ algorithms when using a very small code...

متن کامل

Improved Automatic Classification of Biological Particles from Electron-Microscopy Images Using Genetic Neural Nets

In this paper several neural network classiication algorithms have been applied to a real-world data case of electron microscopy image classiication in which it was known a priori the existence of two diierentiated views of the same specimen. Using several labeled sets as a reference, the parameters and architecture of the classiier (both LVQ trained codebooks and BP trained neural-nets) were o...

متن کامل

Vector Indexing and Lattice Vector Quantization with Reduced or without Look-up Table

This paper describes new vector indexing algorithms for Lattice Vector Quantization (LVQ). The techniques described apply to a large class of lattices such as Z n , A n , D n , D ++ n (including as special cases the Gosset Lattice E 8 , and the lattice of Barnes-wall 1 6), widely used in signal compression. Relying on a partitioning of the events sources, based on a notion of leaders, they allo...

متن کامل

New Ways to Use Lvq - Codebookstogether with Hidden Markov

We introduce a novel way to employ codebooks trained by Learning Vector Quantization together with hidden Markov models. In previous work, LVQ-codebooks have been used as frame labelers. The resulting label stream has been modeled and decoded by discrete observation HMMs. We present a way to extract more information out of the LVQ stage. This is accomplished by modeling the class-wise quantizat...

متن کامل

Supervised Neural Gas and Relevance Learning in Learning Vector Quantization

Learning vector quantization (LVQ) as proposed by Kohonen is a simple and intuitive, though very successful prototype—based clustering algorithm.Generalized relevance LVQ (GRLVQ) constitutes a modification which obeys the dynamics of a gradient descent and allows an adaptive metric utilizing relevance factors for the input dimensions. As iterative algorithms with local learning rules, LVQ and m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Neurocomputing

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2006